The calculation of discriminating kernel based on viability kernel and reachability
نویسندگان
چکیده
منابع مشابه
The calculation of discriminating kernel based on viability kernel and reachability
We discuss the calculation of discriminating kernel for the discrete-time dynamic game and continuous-time dynamic game (namely differential game) using the viability kernel and reachable set. For the discrete-time dynamic game, we give an approximation of the viability kernel by the maximal reachable set. Then, based on the relationship between viability and discriminating kernels, we propose ...
متن کاملObject Recognition based on Local Steering Kernel and SVM
The proposed method is to recognize objects based on application of Local Steering Kernels (LSK) as Descriptors to the image patches. In order to represent the local properties of the images, patch is to be extracted where the variations occur in an image. To find the interest point, Wavelet based Salient Point detector is used. Local Steering Kernel is then applied to the resultant pixels, in ...
متن کاملA Kernel-Based Calculation of Information on a Metric Space
Kernel density estimation is a technique for approximating probability 1 distributions. Here, it is applied to the calculation of mutual information on a metric space. 2 This is motivated by the problem in neuroscience of calculating the mutual information 3 between stimuli and spiking responses; the space of these responses is a metric space. It 4 is shown that kernel density estimation on a m...
متن کاملDiscrimination of time series based on kernel method
Classical methods in discrimination such as linear and quadratic do not have good efficiency in the case of nongaussian or nonlinear time series data. In nonparametric kernel discrimination in which the kernel estimators of likelihood functions are used instead of their real values has been shown to have good performance. The misclassification rate of kernel discrimination is usually less than ...
متن کاملLocal Self-concordance of Barrier Functions Based on Kernel-functions
Many efficient interior-point methods (IPMs) are based on the use of a self-concordant barrier function for the domain of the problem that has to be solved. Recently, a wide class of new barrier functions has been introduced in which the functions are not self-concordant, but despite this fact give rise to efficient IPMs. Here, we introduce the notion of locally self-concordant barrier functio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Difference Equations
سال: 2017
ISSN: 1687-1847
DOI: 10.1186/s13662-017-1429-2